package com.xz;

import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;

/**
 * @author XZ
 * @create 2021-10-18 21:43
 * https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/
 */
public class _107_二叉树的层序遍历2 {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        Deque<TreeNode> deque = new LinkedList<>();
        if (root==null) return new LinkedList<>();
        List<List<Integer>> lists = new ArrayList<>();
        deque.add(root);
        int count = 1;
        while (!deque.isEmpty()) {
            TreeNode node = deque.pop();
        }
        return lists;

    }
}
